On the Deterministic Complexity of Factoring Polynomials
نویسنده
چکیده
The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of Berlekamp (1967, 1970) and Zassenhaus (1969), the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting polynomial over a prime field Fp . Algorithms are designed to split such polynomials. It is proved that a proper factor of a polynomial can be found deterministically in polynomial time, under ERH, if its roots do not satisfy some stringent condition, called super square balanced. It is conjectured that super square balanced polynomials do not exist.
منابع مشابه
Deterministically Factoring Sparse Polynomials into Multilinear Factors
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors. Our result makes partial progress towards the resolution of the classical question posed by von zur Gathen and Kaltofen in [GK85] to devise an efficient deterministic algorithm for factoring (general) sparse polynomials. We achieve our goal by introducing essential factor...
متن کاملOn the Deterministic Complexity of Factoring Polynomials over Finite Fields
We present a new deterministic algorithm for factoring polynomials over Z p of degree n. We show that the worst-case running time of our algorithm is O(p 1=2 (log p) 2 n 2+), which is faster than the running times of previous deterministic algorithms with respect to both n and p. We also show that our algorithm runs in polynomial time for all but at most an exponentially small fraction of the p...
متن کاملCharacter Sums and Deterministic Polynomial Root Finding in Finite Fields
Let Fq be a finite field of q elements of characteristic p. The classical algorithm of Berlekamp [1] reduces the problem of factoring polynomials of degree n over Fq to the problem of factoring squarefree polynomials of degree n over Fp that fully split in Fp, see also [8, Chapter 14]. Shoup [15, Theorem 3.1] has given a deterministic algorithm that fully factors any polynomial of degree n over...
متن کاملFactoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time algorithm that fails to factor only if the input polynomial satisfies a strong symmetry property, namely square balance. In this paper, we propose an extension of Gao’s algorithm that fails only under an even stronger ...
متن کاملAutomorphisms of Rings and Applications to Complexity
Rings are fundamental mathematical objects with two operations, addition and multiplication, suitably defined. A known way of studying the structure of rings is to consider automorphisms of rings. In my PhD thesis I consider finite dimensional rings represented in terms of their additive basis and study the computational complexity of various automorphism problems of rings in this representatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 31 شماره
صفحات -
تاریخ انتشار 2001